Sorting of Linear Combinations of Numbers
نویسنده
چکیده
We address here the problem of sorting a set of linear combinations of three arrays of numbers. Though it has many practical signii-cance, the problem was not addressed earlier. We propose an eecient algorithm for this problem. The main contribution of the work is that we identiied ranges of the parameters of linear combinations for which the sorting order is constant. These ranges for all values of thep-arameters are compiled in a pre-sorting stage requiring O(n 4 logn) and the actual sorting is accomplished in a tree search of O(logn) time. The algorithm is very efective when the sorting is required for very large number of parameters.
منابع مشابه
Involutiveness of linear combinations of a quadratic or tripotent matrix and an arbitrary matrix
In this article, we characterize the involutiveness of the linear combination of the forma1A1 +a2A2 when a1, a2 are nonzero complex numbers, A1 is a quadratic or tripotent matrix,and A2 is arbitrary, under certain properties imposed on A1 and A2.
متن کاملLinear combinations of wave packet frames for L^2(R^d)
In this paper we study necessary and sufficient conditions for some types of linear combinations of wave packet frames to be a frame for L2(Rd). Further, we illustrate our results with some examples and applications.
متن کاملOn the Linear Combinations of Slanted Half-Plane Harmonic Mappings
In this paper, the sufficient conditions for the linear combinations of slanted half-plane harmonic mappings to be univalent and convex in the direction of $(-gamma) $ are studied. Our result improves some recent works. Furthermore, a illustrative example and imagine domains of the linear combinations satisfying the desired conditions are enumerated.
متن کاملSorting Real Numbers in $O(n\sqrt{\log n})$ Time and Linear Space
We present an $O(n\sqrt{\log n})$ time and linear space algorithm for sorting real numbers. This breaks the long time illusion that real numbers have to be sorted by comparison sorting and take $\Omega (n\log n)$ time to be sorted.
متن کاملA New Approach to Solve Fully Fuzzy Linear Programming with Trapezoidal Numbers Using Conversion Functions
Recently, fuzzy linear programming problems have been considered by many. In the literature of fuzzy linear programming several models are offered and therefore some various methods have been suggested to solve these problems. One of the most important of these problems that recently has been considered; are Fully Fuzzy Linear Programming (FFLP), which all coefficients and variables of the prob...
متن کامل